IFA-EO: An improved firefly algorithm hybridized with extremal optimization for continuous unconstrained optimization problems
نویسندگان
چکیده
As one of the evolutionary algorithms, firefly algorithm (FA) has been widely used to solve various complex optimization problems. However, FA significant drawbacks in slow convergence rate and is easily trapped into local optimum. To tackle these defects, this paper proposes an improved combined with extremal (EO), named IFA-EO, where three strategies are incorporated. First, balance tradeoff between exploration ability exploitation ability, we adopt a new attraction model for operation, which combines full single through probability choice strategy. In model, small accepts worse solution improve diversity offspring. Second, adaptive step size proposed based on number iterations dynamically adjust attention or model. Third, combine EO powerful local-search FA. Experiments tested two group popular benchmarks including unimodal multimodal functions. Our experimental results demonstrate that IFA-EO can deal problems similar better performance than other eight variants, EO-based advanced differential evolution variant terms accuracy statistical results.
منابع مشابه
An Improved Firefly Algorithm for Optimization Problems
Optimization problem is one of the most difficult and challenging problems that has received considerable attention over the last decade. Researchers have been constantly investigating better ways to solve it. Recently, one optimization technique called firefly algorithm has gained the interest of many researchers. This algorithm is a type of swarm intelligence algorithm based on the reaction o...
متن کاملFirefly Algorithm for Unconstrained Optimization
Meta-heuristic algorithms prove to be competent in outperforming deterministic algorithms for real-world optimization problems. Firefly algorithm is one such recently developed algorithm inspired by the flashing behavior of fireflies. In this work, a detailed formulation and explanation of the Firefly algorithm implementation is given. Later Firefly algorithm is verified using six unimodal engi...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملFirefly Mating Algorithm for Continuous Optimization Problems
This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA), for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i) the mutual attraction between males and females...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2022
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-022-07607-6